A Combinatorial Proof of a Result from Number Theory
نویسندگان
چکیده
Let rk(n) denote the number of representations of n as a sum of k squares and tk(n) the number of representations of n as a sum of k triangular numbers. We give an elementary, combinatorial proof of the relations rk(8n+ k) = cktk(n), 1 ≤ k ≤ 7, where c1 = 2, c2 = 4, c3 = 8, c4 = 24, c5 = 112, c6 = 544 and c7 = 2368.
منابع مشابه
عدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملProbabilistic Verification of Proofs
Recent research in the theory of computing has led to the following intriguing result. “There exists a probabilistic verifier for proofs of mathematical assertions that looks at a proof in only a constant number of bit positions and satisfies the following properties: (Completeness) For every valid theorem there exists a proof that is always accepted. (Soundness) For invalid assertions every pu...
متن کاملAn Improved Bound for the Crossing Number of C mC n: a Self-Contained Proof Using Mostly Combinatorial Arguments
We present some surprisingly elementary arguments to prove that for every ǫ > 0, if m is sufficiently large, then the crossing number of the Cartesian product Cm × Cn is at least (0.8 − ǫ)mn, for every n ≥ m. The self–contained proof we give involves only one (rather elementary) geometrical result. The rest of the proof involves purely combinatorial arguments.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004